Local Convergence of the Symmetric Rank-One Iteration
نویسندگان
چکیده
We consider conditions under which the SR1 iteration is locally convergent. We apply the result to a pointwise structured SR1 method that has been used in optimal control.
منابع مشابه
Nonlinear Rank-one Modification of the Symmetric Eigenvalue Problem
Nonlinear rank-one modification of the symmetric eigenvalue problem arises from eigenvibrations of mechanical structures with elastically attached loads and calculation of the propagation modes in optical fiber. In this paper, we first study the existence and uniqueness of eigenvalues, and then investigate three numerical algorithms, namely Picard iteration, nonlinear Rayleigh quotient iteratio...
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملMemoryless Modified Symmetric Rank-One Method for Large-Scale Unconstrained Optimization
Problem statement: Memoryless QN methods have been regarded effective techniques for solving large-scale problems that can be considered as one step limited memory QN methods. In this study, we present a scaled memoryless modified Symmetric Rank-One (SR1) algorithm and investigate the numerical performance of the proposed algorithm for solving large-scale unconstrained optimization problems. Ap...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملAn Efficient Gauss-Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
Abstract. We derive and study a Gauss-Newton method for computing a symmetric low-rank product XXT, where X ∈ Rn×k for k < n, that is the closest to a given symmetric matrix A ∈ Rn×n in Frobenius norm. When A = BTB (or BBT), this problem essentially reduces to finding a truncated singular value decomposition of B. Our Gauss-Newton method, which has a particularly simple form, shares the same or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comp. Opt. and Appl.
دوره 9 شماره
صفحات -
تاریخ انتشار 1995